WPCB-Tree: A Novel Flash-Aware B-Tree Index Using a Write Pattern Converter
نویسندگان
چکیده
منابع مشابه
WPCB-Tree: A Novel Flash-Aware B-Tree Index Using a Write Pattern Converter
For the past few years, flash memory has been widely used because of its prominent advantages such as fast access speed, nonvolatility, high reliability, and low power consumption. However, flash memory still has several drawbacks that need to be overcome, e.g., the erase-before-write characteristic and a limited life cycle. Among these drawbacks, the erase-before-write characteristic causes th...
متن کاملP-Tree: A B-Tree Index for Lists
The high frequency of applications involving large, ordered, nested lists suggests that list is the “next most” natural data type after set. A list differs from a set through positioning and nesting elements within the list. Directly supporting such position-related operations will greatly improve the performance of database systems targeting at the above applications. Unlike other attributes, ...
متن کاملBob-Tree: An Efficient B + -Tree Based Index Structure for Geographic-Aware Obfuscation
The privacy protection of personal location information increasingly gains special attention in the field of location-based services, and obfuscation is the most popular technique aiming at protecting this sensitive information. However, all of the conventional obfuscation techniques are geometry-based and separated from the database level. Thus, the query processing has two timeconsuming phase...
متن کاملLS-LRU: A Lazy-Split LRU Buffer Replacement Policy for Flash-Based B+-tree Index
Most embedded systems are equipped with flash memory owing to its shock resistance, fast access, and low power consumption. However, some of its distinguishing characteristics, including out-of-place updates, an asymmetric read/write/erase speed, and a limited number of write/erase cycles, make it necessary to reconsider the existing system designs to explore its performance potential. For exam...
متن کاملA B-Tree index extension to enhance response time and the life cycle of flash memory
Flash memory has critical drawbacks such as long latency of its write operation and a short life cycle. In order to overcome these limitations, the number of write operations to flash memory devices needs to be minimized. The B-Tree index structure, which is a popular hard disk based index structure, requires an excessive number of write operations when updating it to flash memory. To address t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2018
ISSN: 2073-8994
DOI: 10.3390/sym10010018